A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
نویسندگان
چکیده
Jianqin Zhou (Dept. of Computer Science, Anhui University of Technology, Ma’anshan 243002, P. R. China) (E-mail: [email protected]) Abstract: A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m , where p is a prime, q is a prime and a primitive root modulo p. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm.
منابع مشابه
Ju l 2 00 6 Reducing the Computation of Linear Complexities of Periodic Sequences
The linear complexity of a periodic sequence over GF (p) play an important role in cryptography and communication([1]). In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of an arbitrary period un (where u|p−1, gcd(n, p −1) = 1) sequence over GF (p) to the computation of the linear complexities and minimal connectio...
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملReducing the Computation of Linear Complexities of Periodic Sequences over GF(pm)
The linear complexity of a periodic sequence over GF (pm) plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal connection polynomial of a period un sequence over GF (pm) to the computation of the linear complexities and minimal connection polynomials of u period n sequences. T...
متن کاملFast algorithms for determining the linear complexities of sequences over GF (p) with the period 3n
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF (p)(any positive integer m) with the period 3n (n and p−1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm...
متن کاملFast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn Over GF(Pm)
A fast algorithm is derived for determining the linear complexity and the minimal polynomials of sequences over GF (p) with period kn, where p is a prime number, gcd(n, p − 1) = 1 and p − 1 = ku, n, k and u are integers. The algorithm presented here covers the algorithm proposed by Chen for determining the minimal polynomials of sequences over GF (p) with period 2n, where p is a prime, gcd(n, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005